Condensable models of set theory
نویسندگان
چکیده
Abstract A model $${\mathcal {M}}$$ M of ZF is said to be condensable if $$ {\mathcal {M}}\cong {M}}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}} ? ( ? ) ? L for some “ordinal” $$\alpha \in \mathrm {Ord}^{{\mathcal {M}}}$$ ? Ord , where $$\mathcal {M}(\alpha ):=(\mathrm {V}(\alpha ),\in )^{{\mathcal : = V , and $$\mathbb the set formulae infinitary logic {L}_{\infty ,\omega }$$ ? ? that appear in well-founded part . The work Barwise Schlipf 1970s revealed fact every countable recursively saturated cofinally (i.e., ) \prec {M}}}}{\mathcal an unbounded collection ). Moreover, it can readily shown any $$\omega -nonstandard $$\mathrm {ZF}$$ ZF saturated. These considerations provide context following result answers a question posed author by Paul Kindvall Gorbow. Theorem A. Assuming modest set-theoretic hypothesis, there ZFC both definably ( i.e., first order definable element {M)}$$ We also various equivalents notion condensability, including below. B. are equivalent : (a) (b) (c) nonstandard \alpha
منابع مشابه
Models of Set Theory
1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics and the incompleteness theorems 3 1.5. The axioms 4 2. Review of basic set theory 5 2.1. Classes 5 2.2. Well-founded relations and recursion 5 2.3. Ordinals, cardinals and arithmetic 6 3. The consistency of the Axiom of Foundation 8 ...
متن کاملLeibnizian models of set theory
A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the LeibnizMycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF , T has a Leibnizian model iff T proves LM. Here we prove: Theorem A. Every complete theory T extending ZF + LM has 2 א 0 nonisomorphic countable Leibnizian models. Theorem B. ...
متن کاملSlim Models of Zermelo Set Theory
Working in Z+KP , we give a new proof that the class of hereditarily finite sets cannot be proved to be a set in Zermelo set theory, extend the method to establish other failures of replacement, and exhibit a formula Φ(λ, a) such that for any sequence 〈Aλ | λ a limit ordinal 〉 where for each λ, Aλ ⊆ 2, there is a supertransitive inner model of Zermelo containing all ordinals in which for every ...
متن کاملModels of set theory from topological groups
The Boolean prime ideal theorem is a very slightly weaker version of the axiom of choice. In 2011, Andreas Blass showed that models of set theory (with atoms) in which the Boolean prime ideal theorem holds but the full axiom of choice fails correspond with a certain type of topological group. The path taken to prove this surprising result draws not just from set theory but also from combinatori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2021
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-021-00786-3